// 73.矩阵置零
package LeetcodeHot100;

public class Solution073 {
    public void setZeroes(int[][] matrix) {
        boolean sign = false;
        for (int i = 0; i < matrix.length; i++) {
            if (matrix[i][0] == 0)
                sign = true;
        }
        for (int i = 0; i < matrix.length; i++) {
            for (int j = 1; j < matrix[0].length; j++) {
                if (matrix[i][j] == 0) {
                    matrix[0][j] = 0;
                    matrix[i][0] = 0;
                }
            }
        }
        for (int j = 1; j < matrix[0].length; j++) {
            if (matrix[0][j] == 0)
                for (int i = 0; i < matrix.length; i++) {
                    matrix[i][j] = 0;
                }
        }
        for (int i = 0; i < matrix.length; i++) {
            if (matrix[i][0] == 0) {
                for (int j = 0; j < matrix[0].length; j++) {
                    matrix[i][j] = 0;
                }
            }
        }
        if (sign == true) {
            for (int i = 0; i < matrix.length; i++) {
                matrix[i][0] = 0;
            }
        }
    }
}